Ergodicity for the GI/G/1GI/G/1-type Markov Chain

Ergodicity is a fundamental issue for a stochastic process. In this paper, we refine results on ergodicity for a general type of Markov chain to a specific type or the $GI/G/1$-type Markov chain, which has many interesting and important applications in various areas. It is of interest to obtain conditions in terms of system parameters or the given information about the process, under which the chain has various ergodic properties. Specifically, we provide necessary and sufficient conditions for geometric, strong and polynomial ergodicity, respectively.Comment: 16 page

Periodic solutions of a discrete-time diffusive system governed by backward difference equations

A discrete-time delayed diffusion model governed by backward difference equations is investigated. By using the coincidence degree and the related continuation theorem as well as some priori estimates, easily verifiable sufficient criteria are established for the existence of positive periodic solutions

P

This paper investigates the problem of pth moment exponential stability for a class of stochastic neural networks with time-varying delays and distributed delays under nonlinear impulsive perturbations. By means of Lyapunov functionals, stochastic analysis and differential inequality technique, criteria on pth moment exponential stability of this model are derived. The results of this paper are completely new and complement and improve some of the previously known results (Stamova and Ilarionov (2010), Zhang et al. (2005), Li (2010), Ahmed and Stamova (2008), Huang et al. (2008), Huang et al. (2008), and Stamova (2009)). An example is employed to illustrate our feasible results

Asymptotical Mean Square Stability of Cohen-Grossberg Neural Networks with Random Delay

The asymptotical mean-square stability analysis problem is considered for a class of CohenGrossberg neural networks CGNNs with random delay. The evolution of the delay is modeled by a continuous-time homogeneous Markov process with a finite number of states. The main purpose of this paper is to establish easily verifiable conditions under which the random delayed Cohen-Grossberg neural network is asymptotical mean-square stability. By employing Lyapunov-Krasovskii functionals and conducting stochastic analysis, a linear matrix inequality LMI approach is developed to derive the criteria for the asymptotical mean-square stability, which can be readily checked by using some standard numerical packages such as the Matlab LMI Toolbox. A numerical example is exploited to show the usefulness of the derived LMI-based stability conditions

Stability Analysis of Recurrent Neural Networks with Random Delay and Markovian Switching

In this paper, the exponential stability analysis problem is considered for a class of recurrent neural networks (RNNs) with random delay and Markovian switching. The evolution of the delay is modeled by a continuous-time homogeneous Markov process with a finite number of states. The main purpose of this paper is to establish easily verifiable conditions under which the random delayed recurrent neural network with Markovian switching is exponentially stable. The analysis is based on the Lyapunov-Krasovskii functional and stochastic analysis approach, and the conditions are expressed in terms of linear matrix inequalities, which can be readily checked by using some standard numerical packages such as the Matlab LMI Toolbox. A numerical example is exploited to show the usefulness of the derived LMI-based stability conditions.</p

Stability Analysis of Recurrent Neural Networks with Random Delay and Markovian Switching

In this paper, the exponential stability analysis problem is considered for a class of recurrent neural networks RNNs with random delay and Markovian switching. The evolution of the delay is modeled by a continuous-time homogeneous Markov process with a finite number of states. The main purpose of this paper is to establish easily verifiable conditions under which the random delayed recurrent neural network with Markovian switching is exponentially stable. The analysis is based on the Lyapunov-Krasovskii functional and stochastic analysis approach, and the conditions are expressed in terms of linear matrix inequalities, which can be readily checked by using some standard numerical packages such as the Matlab LMI Toolbox. A numerical example is exploited to show the usefulness of the derived LMI-based stability conditions

Transient Distribution of the Length of GI/G/N Queueing Systems

In this paper, we first present the backward equations of Markov skeleton processes, which are then applied to GI/G/N queueing systems.Transient distribution of the length of GI/G/N queueing system is obtained